VSE-ens: Visual-Semantic Embeddings with Efficient Negative Sampling

Jointing visual-semantic embeddings (VSE) have become a research hotpot for the task of image annotation, which suffers from the issue of semantic gap, i.e., the gap between images' visual features (low-level) and labels' semantic features (high-level). This issue will be even more challenging if visual features cannot be retrieved from images, that is, when images are only denoted by numerical IDs as given in some real datasets. The typical way of existing VSE methods is to perform a uniform sampling method for negative examples that violate the ranking order against positive examples, which requires a time-consuming search in the whole label space. In this paper, we propose a fast adaptive negative sampler that can work well in the settings of no figure pixels available. Our sampling strategy is to choose the negative examples that are most likely to meet the requirements of violation according to the latent factors of images. In this way, our approach can linearly scale up to large datasets. The experiments demonstrate that our approach converges 5.02x faster than the state-of-the-art approaches on OpenImages, 2.5x on IAPR-TCI2 and 2.06x on NUS-WIDE datasets, as well as better ranking accuracy across datasets.Comment: Published by The Thirty-Second AAAI Conference on Artificial Intelligence (AAAI-18

VSE-ens: Visual-Semantic Embeddings with Efficient Negative Sampling

Jointing visual-semantic embeddings (VSE) have become a research hotpot for the task of image annotation, which suffers from the issue of semantic gap, i.e., the gap between images' visual features (low-level) and labels' semantic features (high-level). This issue will be even more challenging if visual features cannot be retrieved from images, that is, when images are only denoted by numerical IDs as given in some real datasets. The typical way of existing VSE methods is to perform a uniform sampling method for negative examples that violate the ranking order against positive examples, which requires a time-consuming search in the whole label space. In this paper, we propose a fast adaptive negative sampler that can work well in the settings of no figure pixels available. Our sampling strategy is to choose the negative examples that are most likely to meet the requirements of violation according to the latent factors of images. In this way, our approach can linearly scale up to large datasets. The experiments demonstrate that our approach converges 5.02x faster than the state-of-the-art approaches on OpenImages, 2.5x on IAPR-TCI2 and 2.06x on NUS-WIDE datasets, as well as better ranking accuracy across datasets.Comment: Published by The Thirty-Second AAAI Conference on Artificial Intelligence (AAAI-18

A theoretical framework for the ecological role of three-dimensional structural diversity

The three-dimensional (3D) physical aspects of ecosystems are intrinsically linked to ecological processes. Here, we describe structural diversity as the volumetric capacity, physical arrangement, and identity/traits of biotic components in an ecosystem. Despite being recognized in earlier ecological studies, structural diversity has been largely overlooked due to an absence of not only a theoretical foundation but also effective measurement tools. We present a framework for conceptualizing structural diversity and suggest how to facilitate its broader incorporation into ecological theory and practice. We also discuss how the interplay of genetic and environmental factors underpin structural diversity, allowing for a potentially unique synthetic approach to explain ecosystem function. A practical approach is then proposed in which scientists can test the ecological role of structural diversity at biotic–environmental interfaces, along with examples of structural diversity research and future directions for integrating structural diversity into ecological theory and management across scales

CMPC: An Innovative Lidar-Based Method to Estimate Tree Canopy Meshing-Profile Volumes for Orchard Target-Oriented Spray

Canopy characterization detection is essential for target-oriented spray, which minimizes pesticide residues in fruits, pesticide wastage, and pollution. In this study, a novel canopy meshing-profile characterization (CMPC) method based on light detection and ranging (LiDAR)point-cloud data was designed for high-precision canopy volume calculations. First, the accuracy and viability of this method were tested using a simulated canopy. The results show that the CMPC method can accurately characterize the 3D profiles of the simulated canopy. These simulated canopy profiles were similar to those obtained from manual measurements, and the measured canopy volume achieved an accuracy of 93.3%. Second, the feasibility of the method was verified by a field experiment where the canopy 3D stereogram and cross-sectional profiles were obtained via CMPC. The results show that the 3D stereogram exhibited a high degree of similarity with the tree canopy, although there were some differences at the edges, where the canopy was sparse. The CMPC-derived cross-sectional profiles matched the manually measured results well. The CMPC method achieved an accuracy of 96.3% when the tree canopy was detected by LiDAR at a moving speed of 1.2 m/s. The accuracy of the LiDAR system was virtually unchanged when the moving speeds was reduced to 1 m/s. No detection lag was observed when comparing the start and end positions of the cross-section. Different CMPC grid sizes were also evaluated. Small grid sizes (0.01 m × 0.01 m and 0.025 m × 0.025 m) were suitable for characterizing the finer details of a canopy, whereas grid sizes of 0.1 m × 0.1 m or larger can be used for characterizing its overall profile and volume. The results of this study can be used as a technical reference for the development of a LiDAR-based target-oriented spray system

DNG:Taxonomy expansion by exploring the intrinsic directed structure on non-gaussian space

Taxonomy expansion is the process of incorporating a large number of additional nodes (i.e., ''queries'') into an existing taxonomy (i.e., ''seed''), with the most important step being the selection of appropriate positions for each query. Enormous efforts have been made by exploring the seed's structure. However, existing approaches are deficient in their mining of structural information in two ways: poor modeling of the hierarchical semantics and failure to capture directionality of the is-a relation. This paper seeks to address these issues by explicitly denoting each node as the combination of inherited feature (i.e., structural part) and incremental feature (i.e., supplementary part). Specifically, the inherited feature originates from ''parent'' nodes and is weighted by an inheritance factor. With this node representation, the hierarchy of semantics in taxonomies (i.e., the inheritance and accumulation of features from ''parent'' to ''child'') could be embodied. Additionally, based on this representation, the directionality of the is-a relation could be easily translated into the irreversible inheritance of features. Inspired by the Darmois-Skitovich Theorem, we implement this irreversibility by a non-Gaussian constraint on the supplementary feature. A log-likelihood learning objective is further utilized to optimize the proposed model (dubbed DNG), whereby the required non-Gaussianity is also theoretically ensured. Extensive experimental results on two real-world datasets verify the superiority of DNG relative to several strong baselines

Byzantine-Resilient Multi-Agent Distributed Exact Optimization with Less Data

This paper studies the distributed multi-agent resilient optimization problem under the f-total Byzantine attacks. Compared with the previous work on Byzantineresilient multi-agent exact optimization problems, we do not require the communication topology to be fully connected. Under the redundancy of cost functions, we propose the distributed comparative gradient elimination resilient optimization algorithm based on the traditional assumptions on strongly convex global costs and Lipschitz continuous gradients. Under this algorithm, we successfully prove that if the number of inneighbors of each normal agent is greater than some constant and the parameter f satisfies certain conditions, all normal agents' local estimations of the global variable will finally reach consensus and converge to the optimized solution. Finally, the numerical experiments successfully verify the correctness of the results.Comment: There are some errors in the provement of this pape

A LiDAR Sensor-Based Spray Boom Height Detection Method and the Corresponding Experimental Validation

Sprayer boom height (Hb) variations affect the deposition and distribution of droplets. An Hb control system is used to adjust Hb to maintain an optimum distance between the boom and the crop canopy, and an Hb detection sensor is a key component of the Hb control system. This study presents a new, low-cost light detection and ranging (LiDAR) sensor for Hb detection developed based on the principle of single-point ranging. To examine the detection performance of the LiDAR sensor, a step height detection experiment, a field ground detection experiment, and a wheat stubble (WS) height detection experiment as well as a comparison with an ultrasonic sensor were performed. The results showed that the LiDAR sensor could be used to detect Hb. When used to detect the WS height (HWS), the LiDAR sensor primarily detected the WS roots and the inside of the WS canopy. HWS and movement speed of the LiDAR sensor (VLiDAR) has a greater impact on the detection performance of the LiDAR sensor for the WS canopy than that for the WS roots. The detection error of the LiDAR sensor for the WS roots is less than 5.00%, and the detection error of the LiDAR sensor for the WS canopy is greater than 8.00%. The detection value from the LiDAR sensor to the WS root multiplied by 1.05 can be used as a reference basis for adjusting Hb, and after the WS canopy height is added to the basis, the value can be used as an index for adjusting Hb in WS field spraying. The results of this study will promote research on the boom height detection method and autonomous Hb control system

Dental Implant Navigation System Based on Trinocular Stereo Vision

Traditional dental implant navigation systems (DINS) based on binocular stereo vision (BSV) have limitations, for example, weak anti-occlusion abilities, as well as problems with feature point mismatching. These shortcomings limit the operators’ operation scope, and the instruments may even cause damage to the adjacent important blood vessels, nerves, and other anatomical structures. Trinocular stereo vision (TSV) is introduced to DINS to improve the accuracy and safety of dental implants in this study. High positioning accuracy is provided by adding cameras. When one of the cameras is blocked, spatial positioning can still be achieved, and doctors can adjust to system tips; thus, the continuity and safety of the surgery is significantly improved. Some key technologies of DINS have also been updated. A bipolar line constraint algorithm based on TSV is proposed to eliminate the feature point mismatching problem. A reference template with active optical markers attached to the jaw measures head movement. A T-type template with active optical markers is used to obtain the position and direction of surgery instruments. The calibration algorithms of endpoint, axis, and drill are proposed for 3D display of the surgical instrument in real time. With the preoperative path planning of implant navigation software, implant surgery can be carried out. Phantom experiments are carried out based on the system to assess the feasibility and accuracy. The results show that the mean entry deviation, exit deviation, and angle deviation are 0.55 mm, 0.88 mm, and 2.23 degrees, respectively

High Precision Optical Tracking System Based on near Infrared Trinocular Stereo Vision

A high precision optical tracking system (OTS) based on near infrared (NIR) trinocular stereo vision (TSV) is presented in this paper. Compared with the traditional OTS on the basis of binocular stereo vision (BSV), hardware and software are improved. In the hardware aspect, a NIR TSV platform is built, and a new active tool is designed. Imaging markers of the tool are uniform and complete with large measurement angle (>60°). In the software aspect, the deployment of extra camera brings high computational complexity. To reduce the computational burden, a fast nearest neighbor feature point extraction algorithm (FNNF) is proposed. The proposed method increases the speed of feature points extraction by hundreds of times over the traditional pixel-by-pixel searching method. The modified NIR multi-camera calibration method and 3D reconstruction algorithm further improve the tracking accuracy. Experimental results show that the calibration accuracy of the NIR camera can reach 0.02%, positioning accuracy of markers can reach 0.0240 mm, and dynamic tracking accuracy can reach 0.0938 mm. OTS can be adopted in high-precision dynamic tracking